Home > Search Results: keywords:"zarovnání sekvencí DNA"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Effective Dynamic Programming in Bioinformatics
 Franěk, Jaromír ; Hynek, Jiří (referee) ; Burgetová, Ivana (advisor)
Purpose of this thesis is to study principle of effective algorithms, that are using dynamic programming. Using this knowledge to create application demonstrating principle of effective algorithm of dynamic programming in bioinformatics and write a report summarizing results. Algorithms used in this thesis are solving DNA sequence alignment or RNA secondary structure prediction. These algorithms are compared between themselves based on different input values. For DNA sequence alignment are used algorithms such as Needleman-Wunch and X-drop. For prediction of secondary RNA structure is used Zuker algorithm, that should remove some of Nussin algorithm weaknesses and Nussin algorithm itself. Recursion is showed by recursion trees. Dynamic programming is showed by score matrix. User also have ability to compare speed of both approaches for given sequences. It is programmed as web application, that run on client's side. This ensure easy availability.
Detailed record
Effective Dynamic Programming in Bioinformatics
 Franěk, Jaromír ; Hynek, Jiří (referee) ; Burgetová, Ivana (advisor)
Purpose of this thesis is to study principle of effective algorithms, that are using dynamic programming. Using this knowledge to create application demonstrating principle of effective algorithm of dynamic programming in bioinformatics and write a report summarizing results. Algorithms used in this thesis are solving DNA sequence alignment or RNA secondary structure prediction. These algorithms are compared between themselves based on different input values. For DNA sequence alignment are used algorithms such as Needleman-Wunch and X-drop. For prediction of secondary RNA structure is used Zuker algorithm, that should remove some of Nussin algorithm weaknesses and Nussin algorithm itself. Recursion is showed by recursion trees. Dynamic programming is showed by score matrix. User also have ability to compare speed of both approaches for given sequences. It is programmed as web application, that run on client's side. This ensure easy availability.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English